会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • LINGUISTIC ANALYSIS
    • 语言分析
    • WO2008080190A1
    • 2008-07-10
    • PCT/AU2007/002005
    • 2007-12-21
    • THINKING SOLUTIONS PTY LTDBALL, John
    • BALL, John
    • G06F17/27G06F17/28
    • G06F17/2715G06F17/2785G06F17/2809G06F17/2872G06F17/2881
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting.
    • 本发明涉及语言分析。 特别地,本发明涉及一种操作计算机来执行语言分析的方法。 在另一方面,本发明是实现该方法的计算机系统,在另一方面,本发明是用于对计算机进行编程以执行该方法的软件。 该方法包括以下步骤:将输入文本分割成单词和句子。 对于每个句子,将句子中的短语与存储在数据库中的已知短语进行比较,如下所示:对于句子中的每个单词,将其值和其后面的单词的值与存储短语的单词的值进行比较,从 从该字开始的最长存储的短语,从最长到最短的工作。 如果找到两个或多个连续词的匹配,并考虑短语周围的单词,则使用描述匹配短语的语法使用的超描述来标记匹配的短语。 在比较倒数第二个词之后,通过用匹配的短语替换匹配的短语来重写句子。 然后重复比较过程与重写句子,直到没有进一步的重铸。
    • 2. 发明专利
    • Linguistic analysis
    • AU2019240606B2
    • 2021-04-15
    • AU2019240606
    • 2019-10-02
    • THINKING SOLUTIONS PTY LTD
    • BALL JOHN
    • G06F40/30G06F40/216G06F40/42G06F40/55G06F40/56
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting.
    • 3. 发明专利
    • Linguistic analysis
    • AU2017235908A1
    • 2017-10-19
    • AU2017235908
    • 2017-09-26
    • THINKING SOLUTIONS PTY LTD
    • BALL JOHN
    • G06F17/27G06F17/28
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting.
    • 4. 发明专利
    • Linguistic analysis
    • AU2019240606A1
    • 2019-10-24
    • AU2019240606
    • 2019-10-02
    • THINKING SOLUTIONS PTY LTD
    • BALL JOHN
    • G06F17/27G06F17/28
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting.
    • 5. 发明专利
    • Linguistic analysis
    • AU2007339735A1
    • 2008-07-10
    • AU2007339735
    • 2007-12-21
    • THINKING SOLUTIONS PTY LTD
    • BALL JOHN
    • G06F17/27G06F17/28
    • A method of operating a computer to perform linguistic analysis includes the steps of splitting an input text into words and sentences; for each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: for each word in the sentence, comparing its value and values of words following it with values of words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest; in the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase; after the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases; and then repeating the comparison process with the recast sentence until there is no further recasting.
    • 6. 发明专利
    • Linguistic Analysis
    • AU2013219188A1
    • 2013-09-12
    • AU2013219188
    • 2013-08-21
    • THINKING SOLUTIONS PTY LTD
    • BALL JOHN
    • G06F17/27G06F17/28
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting. WO 2008/080190 PCT/AU2007/002005 Split Input Text into Words Sentence for Parse Round j to Wj(1) Wj(2) ... Wj (Lj) TEXT PARSING (Parse Round j) Match unknown phrases in the Input Sentence with known phrases in the database. See Fig. 2. 140 Changes Made? OI IDOTITI IT OLICCT IDI II [ nL.% DrtIA I I
    • 7. 发明公开
    • LINGUISTIC ANALYSIS
    • 语言分析
    • EP2115630A1
    • 2009-11-11
    • EP07845441.0
    • 2007-12-21
    • Thinking Solutions Pty Ltd
    • BALL, John
    • G06F17/27G06F17/28
    • G06F17/2715G06F17/2785G06F17/2809G06F17/2872G06F17/2881
    • The invention concerns linguistic analysis. In particular the invention involves a method of operating a computer to perform linguistic analysis. In another aspect the invention is a computer system which implements the method, and in a further aspect the invention is software for programming a computer to perform the method. The method comprising the steps of: Splitting an input text into words and sentences. For each sentence, comparing phrases in the sentence with known phrases stored in a database, as follows: For each word in the sentence, comparing its value and the values of the words following it with the values of the words of stored phrases, starting with the longest stored phrase that starts with that word, and working from longest to shortest. In the event a match is found for two or more consecutive words, and considering the words around the phrase, labelling the matched phrase with an overphrase that describes the grammar use of the matched phrase. After the penultimate word has been compared, recasting the sentence by replacing the matched phrases by their respective overphrases. Then repeating the comparison process with the recast sentence until there is no further recasting.