In the field of computational linguistics, the representation of natural
languages (NL) in formal grammar terms is a well-known issue and a wicked
problem indeed. In fact, some formal grammars lack lexical and semantic
information representation, reducing the linguistic structure to syntax.
On the other side, approaches like dependency grammars lose expressive
power, under a computational point of view. Adpositional grammars (adgrams)
are a novel grammar formalism that overcomes these limitations.
|