Patent ID: 12236181

DETAILED DESCRIPTION

The following description is made with reference to the accompanying drawings and is provided to assist in a comprehensive understanding of various example embodiments of the present disclosure. It includes various details to assist in that understanding, but these are to be regarded as merely examples. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the examples described herein can be made without departing from the spirit and scope of the present disclosure. In addition, descriptions of well-known functions and constructions may be omitted for clarity and conciseness.

The terms and words used in the following description and claims are not limited to the bibliographical meanings, but are merely used to enable a clear and consistent understanding of the present disclosure. Accordingly, it should be apparent to those skilled in the art that the following description of the present disclosure is provided for illustration purpose only, and not for the purpose of limiting the present disclosure as defined by the appended claims and their equivalents.

It is to be understood that the singular forms “a”, “an”, and “the”, include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to “a processor” or “a memory” includes reference to one or more of such processors or memories.

The expressions such as “include” and “may include” which may be used in the present disclosure denote the presence of the disclosed functions, operations, and constituent elements, and do not limit the presence of one or more additional functions, operations, and constituent elements. In the present disclosure, terms such as “include” and/or “have”, may be construed to denote a certain characteristic, number, operation, constituent element, component or a combination thereof, but should not be construed to exclude the existence of or a possibility of the addition of one or more other characteristics, numbers, operations, constituent elements, components or combinations thereof.

In the present disclosure, the expression “and/or” includes any and all combinations of the associated listed words. For example, the expression “A and/or B” may include A, may include B, or may include both A and B.

In the present disclosure, expressions including ordinal numbers, such as “first”, “second”, and/or the like, may modify various elements. However, such elements are not limited by the above expressions. For example, the above expressions do not limit the sequence and/or importance of the elements. The above expressions are used merely for the purpose of distinguishing an element from the other elements. For example, a first box and a second box indicate different boxes, although both are boxes. For further example, a first element could be termed a second element, and similarly, a second element could also be termed a first element without departing from the scope of the present disclosure.

Unless otherwise defined, all terms including technical and/or scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the present disclosure pertains. In addition, unless otherwise defined, all terms defined in generally used dictionaries may not be overly interpreted.

FIG.1is a diagram illustrating a computing system100that is capable of implementing the first and second embodiments of the present disclosure. The computing system100includes a processor110, a storage unit120, an input unit130, an output unit140, and a user interface150.

The processor110may be one or more central processing units (CPUs), microprocessors, and/or other hardware devices suitable for retrieval and execution of instructions stored in the storage unit120and/or another storage device (e.g., a non-transitory computer readable storage medium). The processor110may fetch, decode, and execute program instructions and/or executable code (i.e., a program) to determine whether string text will fit in a target area of a user interface or graphics file, as described below in the first embodiment of the disclosure. Additionally, the processor110may fetch, decode, and execute program instructions and/or executable code (i.e., a program) to determine whether a string category is properly assigned to a target area of a user interface or graphics file, as described below in the second embodiment of the disclosure. As an alternative or in addition to retrieving and executing instructions, the processor110may include one or more electronic circuits comprising a number of electronic components for performing the functionality of one or more of the instructions.

The storage unit120may be any non-transitory machine-readable storage medium for maintaining data accessible to the computing system100. For example, the storage unit120may include one or more hard disk drives, solid state drives, tape drives, and/or any other storage devices. The storage devices may be located in the computing system100and/or in another device that is in communication with the computing system100. For example, the storage unit120may be any electronic, magnetic, optical, or other physical storage device that stores executable code. Thus, the storage unit120may be, for example, Random Access Memory (RAM), an Electrically-Erasable Programmable Read-Only Memory (EEPROM), a storage drive, an optical disc, and the like. As described in detail below, the storage unit120may include executable code for determining whether string text will fit in a target area of a user interface of a device or a target area of a graphics file and/or for determining whether a string category is properly assigned to a target area of a user interface or graphics file. As also detailed below, the storage unit120may maintain and/or store the data and information described herein.

The input unit130may include hardware and/or software components that are configured to allow the computing system100to receive data and information, via wired and/or wireless communication, from other electronic devices, such as a computer, a server, a handheld device, a removable storage medium, and the like.

The output unit140may include a display, such as a liquid crystal display, a touch screen, a speaker, a printer, and/or hardware and/or software components that are configured to allow the computing system100to output data and information, via wired and/or wireless communication, to other electronic devices, such as a computer, a server, a handheld device, a removable storage medium, and the like.

The user interface150may include a keyboard, a mouse, a microphone, a touch screen, and the like.

The program instructions (e.g., executable code) executed by the computing system100to determine whether string text will fit in a target area of a user interface of a device or a target area of a graphics file and/or to determine whether a string category is properly assigned to a target area of a user interface or graphics file can be created using one or more programming languages such as, e.g., Java®, C, C++, C #, Visual Basic®, VB.NET, Perl, Ruby®, Python, or other programming languages, possibly using object oriented design and/or coding techniques.

First Embodiment

The computing system100executes the method of the first embodiment by utilizing two files, a text category definition file200and a string file300.FIG.2schematically illustrates an example of the text category definition file200, which can be implemented in any number of formats including, for example, XML format. The text category definition file200contains a list of (i.e., one or more) defined string categories210. Each of the defined string categories210can be based on a predefined standard, such as IEEE 11073-10207, and correspond to a target area of a user interface of a device or a graphics file in which string text is to be rendered. The target area can be a display, such as a liquid crystal display (LCD), of the device or a specific portion of the display that is, for example, displaying a graphical user interface. In other words, if the display is displaying a graphical user interface, the graphical user interface may have, as the target area, a designated area (i.e. window) in which the string text is to be rendered. Further, the target area may be a defined area within a graphics file designated to contain particular information. The graphics file can be displayed, printed or otherwise output.

Further, a single device may be associated with a number of defined string categories210. The device may include a number of modes whereby the target area associated with each of the modes is different in size and/or location on the display. As an example, the device could be a patient monitoring system having a first mode where the oxygen saturation of a patient's blood is rendered in a window having a first size on the display (i.e., first target area) and a second mode where the patient's heart rate is rendered in a window having a second size on the display (i.e., second target area). In this example, the first and second windows have different sizes and, therefore, are associated with different defined string categories.

The device also could have a third mode where both the oxygen saturation of the patient's blood and the patient's heart rate are rendered on the display at the same time in windows on the display having sizes that are different from those of the first and second modes, respectively. In this case, the windows used in the third mode could also be associated with different defined string categories. Thus, each of the modes of the device can be associated with one or more defined string categories210.

Similarly, a single graphics file may be associated with one or more defined string categories210. That is, the graphics file might have multiple target areas of different sizes respectively associated with different defined string categories. Each of the defined string categories210includes maximum width information220and maximum height information230. The computing system100uses the maximum width information220and the maximum height information230of the string category210to generate first reference text240that is representative of the maximum width and second reference text250that is representative of the maximum height of the target area of the user interface or graphics file associated with that defined string category210.

The maximum width information220can be specified as a number of full-width characters and the maximum height information230can specified as a number of rows of characters. The computing system100can use the maximum width information220to generate a number of full-width characters of the first reference text240that correspond to the maximum width of the target area. As illustrated inFIG.3, the full-width characters used to specify the maximum width of the first reference text240can be, for example, em dashes (—) in a particular font and font size, such as 9-point Arial em dashes. InFIG.3, three em dashes are illustrated as the first reference text240. However, the character, font and font size used to indicate the maximum width are not limited to this, and other characters, fonts and/or font sizes can be used.

Further, the computing system100can use the maximum height information230to generate a number of rows of characters of the second reference text250that correspond to the maximum height of the target area. As illustrated inFIG.3, the characters used to specify the maximum height of the second reference text250can be, for example, vertical bars (I) in a particular font and font size, such as 9-point Arial vertical bars. InFIG.3, two vertical bars are illustrated as the second reference text250. However, the character, font and font size used to indicate the maximum height are not limited to this, and other characters, fonts and/or font sizes can be used.

The text category definition file200can be a separate file that is stored on the storage unit120of the computing system100. On the other hand, the text category definition file200can be stored, for example, at a different location that is accessible by the computing system100via the input unit130or on a removable medium that can be utilized with the computing system100via the input unit130. With the text category definition file200being a separate file that is accessed by the computing system100during the execution of the instructions to determine whether string text will fit in a target area of a user interface of a device or a graphics file, the string categories210contained therein can be easily updated and new string categories210can be added without affecting the instructions. This allows the text category definition file200to be updated to reflect changes in user interface or graphics file design.

FIG.4illustrates an example of the string file300, which also can be implemented in any number of formats including, for example, XLIFF format. The string file300includes a number of (i.e., one or more) string entries310each representing a target area of a user interface of a device or a target area of a graphics file. Each of the string entries310includes a string category320and string text330. The string category320identifies the target area of the user interface of the device or the target area of the graphics file in which the string text330of the same string entry310is desired to be rendered. In other words, the computing system100uses the string category320to identify a corresponding defined string category210in the text category definition file200.

The string text330is the text that is to be rendered in a target area of a user interface of the device or the graphics file identified by the string category320in the same string entry310. The string text330can be in the same font and font size as the first reference text240and the second reference text250generated by the computing system100based on the maximum width information220and the maximum height information230, respectively, contained in the corresponding defined string category210. For example, the string text330can be in 9-point Arial font. However, the string text330is not limited to this and can be in any font and any font size, and can be completely independent of the font and font size of the first reference text240and the second reference text250.

The font size of the string text330can be larger or smaller than that of the first reference text240and the second reference text250generated by the computing system100based on the maximum width information220and the maximum height information230depending on the language of the string text330. For example, in a case where the characters of the first reference text240and the second reference text250generated by the computing system100are English characters and the string text330is in another language, such as Japanese, Chinese or Korean, the font size of the string text330can be increased by, for example, 12%, as compared to the font size of the first reference text240and the second reference text250.

FIGS.5A-5Cillustrate an example of the method (i.e., operations) performed by the processor110of the computing system100for determining whether string text will fit in a target area of a user interface of a device or a graphics file. Initially, it is noted that the computing system100has the text category definition file200stored in the storage unit120or some other memory associated with the computing system100, obtains the text category definition file200via the input unit130and stores the text category definition file200in the storage unit120or some other memory, or accesses the text category definition file200at a different location or on a removable medium via the input unit130.

The computing system100then accesses the string file300having the at least one string entry310that includes a string category320and string text330(S100). The string file300can also be stored in the storage unit120or some other memory associated with the computing system100, or otherwise obtained in a manner similar to the text category definition file200as detailed above.

After accessing the string file300, the computing system100reads the first string entry310from the string file300(S200) and performs a comparison to determine whether the string category320associated with the first string entry310corresponds to a defined string category210stored in the text category definition file200(S300). If the string category320does not correspond to a defined string category210in the list of defined string categories210(NO), the computing system100determines that the string category320does not exist (S400). The computing system100also can issue a notification at this time that the string category320does not exist via the output unit140.

On the other hand, if the computing system100determines that the string category320does correspond to one of the defined string categories210(YES), the computing system100generates the first reference text240based on the maximum width information220and the second reference text250based on the maximum height information230associated with the corresponding defined string category210(S500).

It should also be noted that the string categories320of the string entries310could have been previously selected directly from the defined string categories210and checked for accuracy. If this is the case, the comparison to determine whether the string category320associated with the first string entry310corresponds to a defined string category210stored in the text category definition file200(i.e., S300) becomes unnecessary, and a situation where the computing system100determines that the string category320does not exist (i.e., S400) will not occur. In other words, in this alternative scenario, the computing system100reads the first string entry310from the string file300(S200) and then generates the first reference text240based on the maximum width information220and the second reference text250based on the maximum height information230associated with the corresponding defined string category210(S500).

The maximum width information220and the maximum height information230can each be, for example, a numeric value. That is, if the maximum width information220is “3” and the maximum height information230is “2”, the computing system100will generate the first reference text240as, for example, three characters and the second reference text250as, for example, characters in two rows. As noted above, the character(s) generated as the first reference text240can be, for example, full-width characters that represent the maximum width and the character(s) generated as the second reference text250can be, for example, a number of characters in rows (i.e., lines) that represent the maximum height.

The computing system100can then render the generated first reference text240, the generated second reference text250, and the string text330on the output unit140(S600).FIG.6illustrates an example of what such a rendering on the output unit140could look like.

The computing system100then determines a number of pixels of the first reference text240in a horizontal direction and a number of pixels of the second reference text250in a vertical direction (S700). As illustrated inFIG.7, the computing system100can obtain the number of pixels of the first reference text240in the horizontal direction by, for example, generating a first box700around all of the full-width characters of the first reference text240that represent the maximum width, and then determining a number of pixels in the horizontal direction contained within the first box700. Similarly, as also illustrated inFIG.7, the computing system100can obtain the number of pixels of the second reference text250in the vertical direction by, for example, generating a second box710around all of the characters of the second reference text250in rows that represent the maximum height, and then determining a number of pixels in the vertical direction contained within the second box710.

Further, it is noted that the first reference text240and the second reference text250could be rendered at positions on the output unit140such that the computing system100can generate a single box that surrounds both the first reference text240and the second reference text250. In this case, the number of pixels in the horizontal direction of the first reference text240and the number of pixels in the vertical direction of the second reference text250contained within the single box can be determined.

The computing system100also determines the number of pixels of the string text330in the horizontal direction and the number of pixels of the string text330in the vertical direction (S800). As also illustrated inFIG.7, the computing system100can obtain the number of pixels of the string text330in the horizontal direction and vertical direction by, for example, generating a third box720around all of the characters of the string text330, and then determining a number of pixels in the horizontal direction and a number of pixels in the vertical direction contained within the third box720.

Once the number of pixels of the first reference text240in the horizontal direction, the second reference text250in the vertical direction, and the string text330in the horizontal and vertical directions are determined, the computing system100compares the number of pixels of the first reference text240in the horizontal direction to the number of pixels of the string text330in the horizontal direction, and compares the number of pixels of the second reference text250in the vertical direction to the number of pixels of the string text330in the vertical direction (S900).

The computing system then determines if the number of pixels of the string text330in the horizontal direction is less than or equal to the number of pixels of the first reference text240in the horizontal direction and the number of pixels of the string text330in the vertical direction is less than or equal to the number of pixels of the second reference text250in the vertical direction (S1000).

If the number of pixels of the string text330in the horizontal direction is less than or equal to the number of pixels of the first reference text240in the horizontal direction and the number of pixels of the string text330in the vertical direction is less than or equal to the number of pixels of the second reference text250in the vertical direction (YES), the computing system100determines that the string text330will be properly (i.e., fully) rendered in the target area of the user interface of the device (S1100). The computing system100can also issue a notification via the output unit140that the string text330will be properly rendered in the target area of the user interface at this time.

On the other hand, if the number of pixels of the string text330in the horizontal direction is greater than the number of pixels of the first reference text240in the horizontal direction and/or the number of pixels of the string text330in the vertical direction is greater than the number of pixels of the second reference text250in the vertical direction (NO), the computing system100determines that the string text330is unable to be rendered in the target area of the user interface of the device (S1200). The computing system100also can issue a notification via the output unit140that the string text330is unable to be rendered in the target area of the user interface of the device at this time via the output unit140.

At this point, the computing system100makes a determination as to whether or not there are any more string entries310in the string file300(S1300). If there are more string entries310(YES), the computing system100reads the next string entry310(S1400), and performs the above-detailed operations with respect to the next string entry310.

If the computing system100determines that there are no more string entries310in the string file300(NO), the computing system100can output the results for the string file300as a whole via the output unit140(S1500). That is, the computing system100can issue a notification that the string file300passes verification if all of the string entries310in the string file300: (1) include a string category320that corresponds to a defined string category210in the text category definition file200; and (2) include a string text330that has a number of pixels in the horizontal direction and the vertical direction that are equal to or less than the number of pixels of the first reference text240in the horizontal direction and equal to or less than the number of pixels of the second reference text250in the vertical direction, respectively. On the other hand, if even one of the string entries310in the string file300does not satisfy both conditions (1) and (2), the computing system100can issue a notification that the string file300fails the verification.

Regarding the notification that one or more of the string entries310fails, the computing system100can change the notification depending on the condition that has been failed. That is, for each of the string entries310, the computing system100can issue, via the output unit140, a notification that the string category320does not correspond to a defined string category210(FIG.8A), a notification that the string text330is too long to be rendered in the target area of the user interface if the number of pixels of the string text330in the horizontal direction is greater than the number of pixels of the first reference text240in the horizontal direction (FIG.8B), and/or a notification that the string text330is too tall to be rendered in the target area of the user interface if the number of pixels of the string text330in the vertical direction is greater than the number of pixels of the second reference text250in the vertical direction (FIG.8C).

Further, it is noted that the first embodiment of the present disclosure may be implemented as any combination of a system, a method, an integrated circuit, and a computer program on a non-transitory computer readable recording medium. The processor and any other parts of the computing system may be implemented as Integrated Circuits (IC), Application-Specific Integrated Circuits (ASIC), or Large Scale Integrated circuits (LSI), system LSI, super LSI, or ultra LSI components which perform a part or all of the functions of the computing system.

Each of the parts of the first embodiment of present disclosure can be implemented using many single-function components, or can be one component integrated using the technologies described above. The circuits may also be implemented as a specifically programmed general-purpose processor, CPU, a specialized microprocessor such as Digital Signal Processor that can be directed by program instructions on a memory, a Field Programmable Gate Array (FPGA) that can be programmed after manufacturing, or a reconfigurable processor. Some or all of the functions may be implemented by such a processor while some or all of the functions may be implemented by circuitry in any of the forms discussed above.

The first embodiment of the present disclosure may be implemented as a non-transitory computer-readable recording medium having recorded thereon a program embodying the methods/algorithms discussed above for instructing the processor to perform the methods/algorithms. The non-transitory computer-readable recording medium can be, for example, a CD-ROM, DVD, Blu-ray disc, or an electronic memory device.

Each of the elements of the first embodiment of the present disclosure may be configured by implementing dedicated hardware or a software program on a memory controlling a processor to perform the functions of any of the components or combinations thereof. Any of the components may be implemented as a CPU or other processor reading and executing a software program from a recording medium such as a hard disk or a semiconductor memory.

The sequence of the steps included in the above-described algorithm are exemplary, and algorithms having a sequence other than the above-described sequences are contemplated. Moreover, steps, or parts of the algorithm, may be implemented simultaneously or in parallel. It is also contemplated that the implementation of the components of the present disclosure can be done with any newly arising technology that may replace any of the above implementation technologies.

The descriptions herein of operations performed by the computing system constitute algorithms and such algorithms can be realized as a computer program on a non-transitory computer readable medium readable by applicable electronic devices serving as the computing system.

The system and method of the first embodiment of this disclosure allow string size to be verified for any display size, display resolution, and display pixel density due to the use of reference text, which decouples string size verification from user interface and/or graphics file testing. Traditionally, string size is verified by testing the text strings on the user interface. This means that if the display is changed, then the text strings need to be re-verified. However, since the system and method of the present disclosure decouple string verification from user interface and graphics file testing, text strings can be verified for any number of target user interfaces and/or graphics files simultaneously when used along with corresponding user interface and/or graphics file design considerations.

Second Embodiment

The computing system100executes the method of the second embodiment by utilizing three files, the text category definition file200, the string file300, and a string test file900. The text category definition file200and the string file300are the same as those discussed above in the first embodiment of the disclosure.

FIG.9schematically illustrates the string test file900, which can be implemented in any number of formats including, for example, XML format. The string test file900includes a number of (i.e., one or more) modified string entries910each corresponding to a target area of a user interface of a device or a target area of a graphics file. Each of the modified string entries910includes a string category320and pseudotranslated text930. The string category320identifies the target area of the user interface of the device or the target area of the graphics file in which the pseudotranslated text930of the same modified string entry910should be fully rendered if the string category320is properly assigned to the target area.

The pseudotranslated text930is text having a size corresponding to a maximum width and a maximum height of the string category320of the same modified string entry910that can be fully rendered in the target area of the user interface or graphics file corresponding to the modified string entry910. The pseudotranslated text930can be in the same font and font size as the string text330in the corresponding string entry310before the string entry310is modified by replacing the string text330with the pseudotranslated text930and saved in the string test file900. The pseudotranslated text930can also be in the same font and font size as the first reference text240and the second reference text250generated by the computing system100based on the maximum width information220and the maximum height information230, respectively, contained in the corresponding defined string category210. For example, the pseudotranslated text330can be in 9-point Arial font. However, the pseudotranslated text930is not limited to this and can be in any font and any font size, and can be completely independent of the font and font size of the first reference text240and the second reference text250and the font and font size of the string text330in the corresponding string entry310.

FIGS.10A-10Cillustrate an example of the method (i.e., operations) performed by the processor110of the computing system100for verifying whether a string category is properly assigned to a target area of a user interface of a device or a target area a graphics file. Initially, it is noted that the computing system100has the text category definition file200stored in the storage unit120or some other memory associated with the computing system100, obtains the text category definition file200via the input unit130and stores the text category definition file200in the storage unit120or some other memory, or accesses the text category definition file200at a different location or on a removable medium via the input unit130.

The computing system100then accesses the string file300having the at least one string entry310associated with a target area of a user interface or graphics file that includes the string category320and the string text330(S2000). The string file300can also be stored in the storage unit120or some other memory associated with the computing system100, or otherwise obtained in a manner similar to the text category definition file200as detailed above.

After accessing the string file300, the computing system100reads the first string entry310from the string file300(S2100) and performs a comparison to determine whether the string category320associated with the first string entry310corresponds to a defined string category210stored in the text category definition file200(S2200). If the string category320does not correspond to a defined string category210in the list of defined string categories210(NO), the computing system100determines that the string category320does not exist (S2300). The computing system100also can issue a notification at this time that the string category320does not exist via the output unit140.

On the other hand, if the computing system100determines that the string category320does correspond to one of the defined string categories210(YES), the computing system100generates the pseudotranslated text930having a width equal to the maximum width information220and a height equal to the maximum height information230associated with the corresponding defined string category210(S2400).

It should also be noted that the string categories320of the string entries310could have been previously selected directly from the defined string categories210and checked for accuracy. If this is the case, the comparison to determine whether the string category320associated with the first string entry310corresponds to a defined string category210stored in the text category definition file200(i.e., S2200) becomes unnecessary, and a situation where the computing system100determines that the string category320does not exist (i.e., S2300) will not occur. In other words, in this alternative scenario, the computing system100reads the first string entry310from the string file300(S2100) and then generates the pseudotranslated text930based on the maximum width information220and the maximum height information230associated with the corresponding defined string category210(S2400).

As noted above, the maximum width information220and the maximum height information230can each be, for example, a numeric value. Therefore, as an example, if the maximum width information220is “10” and the maximum height information230is “2”, the computing system100will generate the pseudotranslated text930as, for example, two rows (i.e., lines) of text each having ten characters as illustrated inFIG.11.

The character(s) generated as the pseudotranslated text930can be any characters including, for example, full-width characters. Further, the first character and the last character of each row of text of the pseudotranslated text930can be different from any of the other characters in the row of text and can be predefined as identifying the first character and the last character of a row. The first character and the last character of each row of text of the pseudotranslated text930can also be the same character.

In addition, at least one of the rows of text of the pseudotranslated text930can also include at least one additional character (i.e., a number) that indicates how many rows of text are in the pseudotranslated text930. The at least one additional character that indicates how many rows of text are in the pseudotranslated text930can be located at any position between the first character and the last character.

InFIG.11, the first and last characters of each line of text of the pseudotranslated text930are “M”, the second character of each line of text is “2”, which indicates that the pseudotranslated text930includes two rows of text, and the remaining characters of each line of text are dashes (—).

Once the pseudotranslated text930is generated, the computing system100then modifies the string entry310associated with the target area of the user interface or graphics file by replacing the string text330with the generated pseudotranslated text930to create a modified string entry910(S2500) and saves the modified string entry910in the string test file900(S2600) illustrated inFIG.9.

At this point, the computing system100makes a determination as to whether or not there are any more string entries310in the string file300(S2700). If there are more string entries310(YES), the computing system100reads the next string entry310(S2800), and performs the above-detailed operations with respect to the next string entry310.

If the computing system100determines that there are no more string entries310in the string file300(NO), the computing system100then begins testing the target area of each user interface or graphics file to determine whether the string category assigned to each of the target areas is properly assigned. That is, the computing system100reads out a first modified string entry910corresponding to the target area of a user interface or graphics file from the string test file900and renders the pseudotranslated text930of the modified string entry910on the corresponding target area of the user interface or graphics file (S2900).

Once the pseudotranslated text930is rendered, the computing system100receives a result as to whether the pseudotranslated text930is fully rendered on the target area (S3000). The result as to whether or not the pseudotranslated text930is fully rendered can be based, in part, on whether the first and last characters in each row of text of the pseudotranslated text930are rendered. That is, since the first and last characters are predefined and different from any other characters in each row of text in the pseudotranslated text930, if the first rendered character of a row of text is not the predefined character, it is apparent that the beginning portion of the pseudotranslated text930is not being rendered. An example of a situation where the beginning portion of the pseudotranslated text930is not rendered is illustrated inFIG.12A, which is based on the pseudotranslated text930illustrated inFIG.11. It is apparent that the beginning portion of the pseudotranslated text930is not being rendered because the predefined first character “M” is missing from the rows of text.

Similarly, if the last rendered character of the rows of text of the pseudotranslated text930is not the predefined character, it is apparent that the end portion of the pseudotranslated text930is not being rendered. An example of a situation where the end portion of the pseudotranslated text930is not being rendered is illustrated inFIG.12B, which is again based on the pseudotranslated text930illustrated inFIG.11. It is apparent that the end portion of the pseudotranslated text930is not being illustrated because the predefined last character “M” is missing from the rows of text.

Further, the result as to whether or not the pseudotranslated text930is fully rendered can also be based, in part, on whether all of the rows of text of the pseudotranslated text930are rendered. That is, as each of the rows of text of the pseudotranslated text930can also include at least one character (e.g., number) that indicates the total number of rows of text, if the number of rendered rows of text is different than the number contained in each of the rows of text, it is apparent that at least one of the upper portion or the lower portion of the pseudotranslated text930is not being rendered. An example of this is illustrated inFIG.12C, which is also based on the pseudotranslated text930illustrated inFIG.11. It is apparent that the number of rows of pseudotranslated text930rendered (i.e., one) is different from the number contained in the row of text (i.e., 2). Thus, at least one of the upper portion or the lower portion of the pseudotranslated text930is not being rendered.

The result as to whether the pseudotranslated text930is fully rendered on the target area of the user interface or graphics file can be determined by, for example, an optical recognition system that has been programmed to be able to recognize the predefined first and last characters, as well as the character(s) indicating the number of rows, contained in the pseudotranslated text930, and provided to the computing system100via the input unit130. The result can also be determined by an operator of the computing system100who views the rendered pseudotranslated text930on the target area of the user interface or graphics file, and enters the result into the computing system100via, for example, the user interface150.

Once the computing system100receives the result, the computing system100records an indication that the string category320is properly assigned to the target area of the user interface or graphics file if the result is that the pseudotranslated text930of the modified string entry910associated with the target area of the user interface or graphics file is fully rendered on the target area, or an indication that the string category320is not properly assigned to the target area if the result is that the pseudotranslated text930of the corresponding modified string entry910is not fully rendered on the target area (S3100). The computing system100can record the indication in the string test file900, the storage unit120, and/or at some other location including in the string file300.

At this point, the computing system100makes a determination as to whether or not there are any more modified string entries910in the string test file900(S3200). If there are more modified string entries910(YES), the computing system100reads the next modified string entry910(S3300), and performs the above-detailed operations with respect to the next modified string entry910.

If the computing system100determines that there are no more modified string entries910in the string test file900(NO), the computing system100has completed the testing (S3400).

It is noted that the second embodiment of the present disclosure may be implemented as any combination of a system, a method, an integrated circuit, and a computer program on a non-transitory computer readable recording medium. The processor and any other parts of the computing system may be implemented as Integrated Circuits (IC), Application-Specific Integrated Circuits (ASIC), or Large Scale Integrated circuits (LSI), system LSI, super LSI, or ultra LSI components which perform a part or all of the functions of the computing system.

Each of the parts of the second embodiment of present disclosure can be implemented using many single-function components, or can be one component integrated using the technologies described above. The circuits may also be implemented as a specifically programmed general-purpose processor, CPU, a specialized microprocessor such as Digital Signal Processor that can be directed by program instructions on a memory, a Field Programmable Gate Array (FPGA) that can be programmed after manufacturing, or a reconfigurable processor. Some or all of the functions may be implemented by such a processor while some or all of the functions may be implemented by circuitry in any of the forms discussed above.

The second embodiment of the present disclosure may be implemented as a non-transitory computer-readable recording medium having recorded thereon a program embodying the methods/algorithms discussed above for instructing the processor to perform the methods/algorithms. The non-transitory computer-readable recording medium can be, for example, a CD-ROM, DVD, Blu-ray disc, or an electronic memory device.

Each of the elements of the second embodiment of the present disclosure may be configured by implementing dedicated hardware or a software program on a memory controlling a processor to perform the functions of any of the components or combinations thereof. Any of the components may be implemented as a CPU or other processor reading and executing a software program from a recording medium such as a hard disk or a semiconductor memory.

The sequence of the steps included in the above-described algorithm are exemplary, and algorithms having a sequence other than the above-described sequences are contemplated. Moreover, steps, or parts of the algorithm, may be implemented simultaneously or in parallel. It is also contemplated that the implementation of the components of the present disclosure can be done with any newly arising technology that may replace any of the above implementation technologies.

The descriptions herein of operations performed by the computing system constitute algorithms and such algorithms can be realized as a computer program on a non-transitory computer readable medium readable by applicable electronic devices serving as the computing system.

The system and method of the second embodiment of this disclosure allow for the verification of whether a string category is properly assigned to a target area of a user interface or graphics file.

It is also noted that although the above description separately describes how the computing system100implements the first and second embodiments, the first and second embodiments can be combined and implemented together by the computing system100.