A non-recursive sentence segmentation, applied to parsing of linear complexity in time
Jacques Vergne · 2005
First, we intend to show that parsing is often seen as a combinatorial problem, for some reasons which are not due to properties of natural languages. Secondly, we describe a method for building a syntax, that we apply to build the foundations for a syntax of natural languages. Thirdly, we apply these syntactic foundations to build a non-combinatorial parser, therefore one of linear complexity in time.