问一道NLP的题目# JobHunting - 待字闺中
s*n
1 楼
Word segmentation.
From an arbitrary input string, we want to be able to extract all relevant
tokens from the string. Relevant is defined as the most probable message
being conveyed in the string.
E.g.
Input: ellow!or#ldt.h.i.s.isasen tence. ano&the*r s e n t-en_ce.
Output: hello world this is a sentence. another sentence.
当时给了一天时间要求完成，任何语言，实在做不出他们要求的解，后来也被拒了
现在想知道这题到底有多难br />
From an arbitrary input string, we want to be able to extract all relevant
tokens from the string. Relevant is defined as the most probable message
being conveyed in the string.
E.g.
Input: ellow!or#ldt.h.i.s.isasen tence. ano&the*r s e n t-en_ce.
Output: hello world this is a sentence. another sentence.
当时给了一天时间要求完成，任何语言，实在做不出他们要求的解，后来也被拒了
现在想知道这题到底有多难br />
