Finite State Transducer Determinizing Device Using Auxiliary Symbols
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determinizing non-single-valued finite state transducers (FSTs) require preprocessing to identify and convert non-single-valued portions, which can lead to incomplete determinization, especially when FSTs lack the 'twins property' or have multiple final outputs, and are not applicable to weighted FSTs without additional preprocessing.
Innovation Solution
A method that introduces auxiliary input symbols to convert non-single-valued FSTs to single-valued FSTs directly during the determinization process, using pseudo-code algorithms to manage states and transitions, allowing for determinization without prior preprocessing, and extends this approach to weighted FSTs by defining specialized operations for weights.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If preprocessing is performed to identify and convert non-single-valued portions before determinization, then the determinization process can handle single-valued FSTs, but the process becomes incomplete for FSTs without the 'twins property' or with multiple final outputs
Solution Approach 1:
The patent applies preliminary action by introducing auxiliary input symbols before the determinization process to mark transitions that lead to multiple final outputs. This preprocessing step identifies and tags non-single-valued portions of the FST, enabling the subsequent determinization algorithm to handle these cases correctly without requiring separate preprocessing for twins property detection or conversion.
Solution Approach 2:
The patent uses auxiliary input symbols as intermediaries to bridge the gap between non-single-valued FSTs and the determinization process. These auxiliary symbols act as mediators that carry information about multiple final outputs through the determinization algorithm, allowing the process to complete successfully for FSTs that would otherwise fail due to lacking the twins property or having multiple final outputs.
2Adaptability or versatility
If traditional determinization methods are used without auxiliary input symbols, then the process is simpler, but it cannot handle weighted FSTs or FSTs without the twins property
Solution Approach 1:
The patent achieves universality by designing a determinization algorithm that can handle multiple types of FSTs through the same framework. By introducing auxiliary input symbols, the algorithm becomes universally applicable to weighted FSTs, FSTs without the twins property, and FSTs with multiple final outputs, eliminating the need for separate preprocessing steps for each case.
Solution Approach 2:
The patent applies parameter changes by modifying the input symbol set to include auxiliary symbols that encode information about weights and multiple final outputs. This parameter modification allows the determinization algorithm to process weighted FSTs and other complex cases by transforming the problem into a form that the algorithm can handle uniformly.
3Reliability
If auxiliary input symbols are introduced to mark transitions to multiple final outputs, then complete determinization is achieved, but the number of input symbols increases
Solution Approach 1:
The patent applies the taking out principle by extracting the information about multiple final outputs and encoding it in auxiliary input symbols. Instead of carrying multiple output symbols through the transitions, the method extracts this information and represents it through dedicated auxiliary symbols, reducing the overall complexity while maintaining completeness.
Data Source
AI summary
According to one embodiment, a finite state transducer determinizing device includes a symbol determination unit, a state merging unit, and a single-value processing unit. The symbol determination unit generates an identification symbol different from an input symbol assigned to each transition of a finite state transducer. The state merging unit extracts one or more states at a transition destination by the same input symbol from among the states of the finite state transducer and generates states having the extracted states as sub-states. The single-value processing unit applies the input symbol assigned to each transition of the finite state transducer or the identification symbol as an input symbol of a transition between the states generated by the state merging unit to perform determinizing.