Parsing Free Word Order Languages
- Speaker: Dr Allan Ramsay (University of Manchester)
- Host: Ian Pratt-Hartmann
- 12th October 2005 at 14:15 in 1.5
Most parsing algorithms for natural language have been designed for languages with relatively fixed word orders. This assumption simply does not hold for many languages (even, in fact, for English), and hence standard parsing algorithms tend to be problematic. In this talk I will present a framework for describing free word order languages, together with an algorithm for analysing the structural relations that hold between words and phrases of such languages. If there is time, I will consider the relationship between the worst case complexity of this algorithm (which is appalling) and its performance in practice (which is quite good), and I will sketch out ways of further improving the practical performance.