Search Results

Natural languages are known to be (mildly) context sensitive at best. That being said, some formal models tend to overgenerate, such as TGG mentioned above. Note that constraint-based formalisms, even …

You could store all tokens in a relational database in a separate table and build up a positional index (sacrificing space for speed of query processing). Then you could use simple SQL expressions to …

The IL used in symbolic NLP is called first-order logic. There are various more or less differing notations but it all boils down to plain old FOL which can easily capture the meaning (literal or cont …

In Davidsonian first-order logic, the semantic representation would be ∃e.not(e) & alien'(e,I) & here(e) where e is the eventuality of being an alien.

Purely statistical MT systems don't use parse trees. However most of today's MT systems use hybrid architectures, i.e. there's at least a shallow syntax module or something alike. Parse trees can't h …

Are you familiar with Sgall's Functional Generative Description (the theoretical framework used in the Prague Dependency Treebank)? He doesn't have synsemantic words in dependency trees and I think th …

To achieve this you need dependencies at deep structure (stripped of all the function words) and lexical mapping. You need a good parser and a valency lexicon with mapping to semantic/θ roles, which i …

Just use what’s listed here: https://universaldependencies.org/en/index.html You can also use the XPOS annotation to experiment with the model, these tags are not directly convertible into UD tags.

Yes, it’s useful. Formal semantics can serve as a basis for the stochastic methods. There are many approaches, let me just mention one — abductive parsing and interpretation. It’s based on formal sema …

It depends on the framework. Within LFG, parsing is NP-compete in the worst case. However, Ron Kaplan argues that NL parsing is polynomial in the average case. In general, NL parsing is NP-complete be …

There are two approaches to MT: rule-based and statistical. The former is “more linguistic” in the sense that it uses rules based on linguistic knowledge. This includes morphology (the lexicon), synta …

Lambda calculus is a way of turning open expressions (that is, expressions with free variables) into functions. For example, λx.x+1 is a function that takes numbers to numbers. λx.x+y is a function fr …

I'd recommend looking at Jerry Hobbs' way of parsing and representing English, it's one of the most elaborate ones when it comes to logic and commonsense representation: Jerry Hobbs: "Discourse and I …