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 & past_tense & actor & furiously & patient).

PropertyValue
dbpprop:abstract
  • 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 & past_tense & actor & furiously & patient). Another example would be "Sally said John is mean", which could be expressed as something like (Exists u,v)(saying & past_tense & actor & that & is & actor & mean). This is so that statements which seemingly cannot be expressed in classical first-order predicate calculus, due to their use of tense, modality, adverbial constructions, propositional arguments (e.g. "Sally said that X"), etc. , can in fact be manipulated using only the tools of classical first-order predicate calculus. 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 for manipulating it.
dbpprop:hasPhotoCollection
rdfs:comment
  • 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 & past_tense & actor & furiously & patient).
rdfs:label
  • Reification (linguistics)
owl:sameAs
skos:subject
foaf:page
is dbpprop:disambiguates of