Formalizing Natural Languages by Silberztein Max;

Author:Silberztein, Max; [Silberztein, Max]
Language: eng
Format: epub
Publisher: John Wiley & Sons, Incorporated
Published: 2016-04-11T00:00:00+00:00

Figure 6.11. Incorporating the node “red”

Next we complete the node “pretty” by incorporating its continuation:

Figure 6.12. Incorporating the node “pretty”

Next we include the node “very”:

Figure 6.13. Completeing the node “very”

And finally we complete the graph with the node tagged “the” (Figure 6.14).

Figure 6.14. Final graph

The regular expression thus constructed:

the very very* pretty red flower | the red flower

represents the same language as the starting finite-state graph. The two advantages of using regular expressions rather than graphs are:

– when the query is very simple (for example a sequence of a few words), it is much quicker to enter it directly rather than opening the graph editor;

–regular expressions can be easily constructed automatically by computer programs. A NLP application could apply a regular expression to a technical text in order to find a few terms characteristic of a technical domain, and then reinsert parts of the resulting index into the initial regular expression to expand it (to find other terms), re-applying and enriching the regular expression until a fixed point is reached, at which point the final regular expression recognizes a large set of technical terms found in the text.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.