DocumentCode
2668354
Title
Parsing pregroup grammars in polynomial time
Author
Moroz, Katarzyna
Author_Institution
Fac. of Math. & Comput. Sci., Adam Mickiewicz Univ., Poznan, Poland
fYear
2009
fDate
12-14 Oct. 2009
Firstpage
257
Lastpage
264
Abstract
We consider polynomial time recognition algorithm and parsing procedures for pregroup grammars. In particular, we present a cubic parsing algorithm for ambiguous pregroup grammars. It modifies the of Savateev for categorial grammars based on L. We present a Java application that uses the algorithm for parsing natural language sentences. We apply metarules to keep the lexicon reasonably small.
Keywords
computational complexity; context-free grammars; process algebra; Java application; Savateev recognition algorithm; ambiguous pregroup grammars; categorial grammars; context-free grammer; cubic parsing algorithm; lexicon; metarules; parsing natural language sentences; parsing procedures; polynomial time recognition algorithm; Argon; Calculus; Computer science; Information technology; Java; Logic; Mathematics; Natural languages; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology, 2009. IMCSIT '09. International Multiconference on
Conference_Location
Mragowo
Print_ISBN
978-1-4244-5314-6
Type
conf
DOI
10.1109/IMCSIT.2009.5352719
Filename
5352719
Link To Document