|This article needs additional citations for verification. (July 2007) (Learn how and when to remove this template message)|
Reification in natural language processing refers to where a natural language statement is transformed so actions and events in it become quantifiable variables. For example "John chased the duck furiously" can be transformed into something like
- (Exists e)(chasing(e) & past_tense(e) & actor(e,John) & furiously(e) & patient(e,duck)).
Another example would be "Sally said John is mean", which could be expressed as something like
- (Exists u,v)(saying(u) & past_tense(u) & actor(u,Sally) & that(u,v) & is(v) & actor(v,John) & mean(v)).
Such representations allow one to use the tools of classical first-order predicate calculus even for statements which, due to their use of tense, modality, adverbial constructions, propositional arguments (e.g. "Sally said that X"), etc., would have seemed intractable. This is an advantage because predicate calculus is better understood and simpler than the more complex alternatives (higher-order logics, modal logics, temporal logics, etc.), and there exist better automated tools (e.g. automated theorem provers and model checkers) for manipulating it.
Not all natural language constructs admit a uniform translation to first order logic. See donkey sentence for examples and a discussion.
- Drinker paradox
- Reification (computer science)
- Reification (fallacy)
- Reification (knowledge representation)
- Dekang Lin and Patrick Pantel, "DIRT – Discovery of Inference Rules from Text", (2001) KDD01-Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
- Hoifung Poon and Pedro Domingos "Unsupervised Semantic Parsing" (2009) EMNLP09: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing
|This computational linguistics-related article is a stub. You can help Wikipedia by expanding it.|