Grammatical analysis of languages with lexical and syntactic ambiguities

Authors:
V. A. Lapshin
Affiliations:
ABBYY Co., Moscow, Russia
Venue:
Automatic Documentation and Mathematical Linguistics
Year:
2012

Citing 2
Cited 0

An efficient context-free parsing algorithm

Communications of the ACM
Mathematical Linguistics

Mathematical Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of parsing languages with lexical ambiguities is considered. An algorithm for lexical analysis is proposed that allows the correct processing of various ambiguities. For this algorithm, we propose an algorithm for parsing to make it possible to correctly process both lexical and syntactic ambiguities.