Non-simplifying Graph Rewriting Termination

TERMGRAPH, pp. 4-16, 2013.

Cited by: 1|Views5
EI

Abstract:

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs ...More

Code:

Data:

Your rating :
0

 

Tags
Comments