The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
An ever present, common sense idea in language modelling research is that, for a word to be a valid phrase, it should comply with multiple constraints at once. A new language definition model is studied, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet can be interpreted...
An ever present, common sense idea in language modelling research is that, for a
word to be a valid phrase, it should comply with multiple constraints at
once. A new language definition model is studied, based on agreement or consensus
between similar strings. Considering a regular set of strings over a bipartite
alphabet made by pairs of unmarked/marked symbols, a match relation is
introduced, in order to specify when such strings agree. Then a regular set
over the bipartite alphabet can be interpreted...
Download Results (CSV)