SO THAT'S THEY UM ACCESS PROBABLY THIS FILE AND THEN THEY DISPLAY THE WORDS SO WHY SHOULDN'T WE BE ABLE TO DO THAT UH NO BUT I THINK IT'S TOO EARLY TO REALLY LIKE DISCUSS THAT IN DETAIL BECAUSE WE DON'T AT ALL UNDERSTAND AT THE MOMENT HOW THE INTERNAL DATA STRUCTURE LIKE HOW THE LOADING WORKS SO MAYBE IF WE G IF WE GO AHEAD DO YOU THINK IT WOULD BE POSSIBLE FOR YOU TO DO AN LIKE SOMETHING LIKE SEGMENTS OR MAYBE JUST A COPY OF SEGMENT WHICH HAS AN ATTRIBUTE FOR FOR EACH SEGMENT UM BUT IT IS LIKE WITH A WITH A VALUE WITH A DENSITY VALUE YEAH I THIN I MEAN IT WOULDN'T BE DIFFICULT TO UM CREATE A FILE OF THE P SH OF THAT SHAPE I MEAN THAT WOULD BE NO PROBLEM SO WOULD IT BE EASY FOR YOU TO TO TIE THE THINGS TOGETHER LIKE IF YOU'RE DOING IT ON ON THE WORD BASIS HERE WITH THOSE WORDS THAT IN THE END YOU THEN TIE IT BACK IN INTO THE RIGHT SEGMENT HERE I MEAN YOU PROBABLY HAVE TO DO A BIT OF BUT UM FOR MY SEGMENTS WERE THE UM F. ZERO MEASUREMENTS AND ALL THOSE VALUES I GET FROM THERE UM I ALWAYS STORE THE BEG UH START AND END TIME OF EVERYTHING I CALCULATED THERE SO I WOULD JUST HAVE TO PU PUT IT UH YES SO THIS ISN'T DIRECTLY HAVING TIME REFERENCES BUT YOU CAN GET THE OH IT IS ACTUALLY HERE OKAY SO IF YOU SLICE IT UP BY TIME YOU'D PROBABLY BE ABLE TO JUST LIKE ATTACH LIKE JUST SOME ATTRIBUTE OF INFO VAL JUST F TO EACH OF THOSE SEGMENTS UH ACTU BUT ACTUALLY MY SEGMENTS ARE NOT ALWAYS THE SAME AS THEIR SEGMENTS BECAUSE AND THEIR SEGMENTS THERE ARE UM PAUSE UM PAUSES SOMETIMES A UM YES BUT UH YEAH I MEAN ONE SEGMENT OF THEIRS IS SOMETIMES TWO SEGMENTS OF MINE THAT'S JUST WHAT I MEANT OKAY 'KAY UM I DON'T UNDERSTAND ENOUGH OF WHAT THEIR DATA STRUCTURE IS THIS PROBABLY WOULD BE A LOT EASIER WOULD I REALLY UNDERSTAND HOW THEY ARE HANDLING THE DATA INTERNALLY 'CAUSE THEN WE C THEN I COULD SAY OH IT'S EASY TO JUST TIE IT IN IF YOU JUST HAVE IT TIME STAMPED THAT JUST REFERENCE BY WORDS AND STUFF BUT T AT THE MOMENT SO YOU WOULD YOU'RE DOING I YOU'RE DOING A WORD BY WORD BASE YEAH THE PROBLEM IS PROBABLY THAT UM I EXTRACT ALL THE WORDS AND THEN UH I DON'T UM USE AN I. D. OR SOMETHING FOR IT SO IT WOULD BE DIFFICULT TO WRITE IT BACK TO THE RIGHT POSITION IT DEPENDS ON THE POSITION I THINK YEAH HMM AND YOU'RE DOING THIS VIA SOME SOFTWARE THAT'S LIKE EXTERNAL SOFTWARE SO YOU CAN'T YEAH I I COULD USE ANOTHER A DIFFERENT APPROACH THOUGH IT YOU WRITE AN ALGORITHM WHICH WHICH THEN GOES BACK BECAUSE THEY THEY'RE IN THE RIGHT ORDER STILL AND STUFF RIGHT SO THAT SHOULDN'T BE A PROBLEM OH BUT THIS IS BY SPEAKER HERE WHICH MAKES IT SLIGHTLY MORE DIFFICULT HMM THE PROBLEM IS THAT ACTUALLY NITE X. M. L. PROBABLY PROVIDES A LOT OF THE TOOLS THAT WE'D NEED TO DO THAT MM-HMM IT COULD CONTAIN END TIMES AND WORDS FOR ALL SPEAKERS OF ALL MEETINGS I MEAN THAT'S JUST THE SAME THING AS I GAVE YEAH AS I GAVE TO YOU BUT UM UH DISPLAYING ALSO A START AND END TIMES OF EVERY WORD SO YOU COULD PERHAPS USE IT TO MATCH UM IT WITH YOUR ADDITIONAL INFORMATION YOU GOT COULDN'T YOU PERL A PERL SCRIPT YEAH YOU DIDN'T USE AN X. M. L. PARSER NO NO OKAY UM WOULD YOU THINK IT WOULD MAKE SENSE TO JUST TAKE UM FILE FILES BY SPEAKER IT'S IT DOESN'T MATTER WHAT INPUT I GIVE TO UM TO RAINBOW SO I JUST COULD G USE THE FILES AS THEY ARE I DON'T KNOW IF THAT'S THAT WOULD GIVE AN OUTPUT I DON'T KNOW MM YEAH NO IT UM I THINK IT'S NOT UH VERSUS THE WHOLE CORPUS IT'S UM YOU HAVE CERTAIN CATEGORIES AND YOU MEASURE WHICH WORDS UM HAVE THE HIGHEST INFORMATION FOR ONE CATEGORY SO IT'S THE CATEGORIES ACROSS EACH OTHER I THINK BUT WOULD YOU THEN NOT GET THE TYPICAL WORDS FOR EVERY SPEAKER IF YOU BUT YEAH IT'S IT'S S STRANGE YEAH NO BUT I MEAN IT CAN'T BE THAT DIFFICULT IF YOU IF YOU ALREADY HAVE YOU HAVE IN THE RIGHT ORDER ALL THE WORDS WITH A WITH A SCORE TO THEM AND YOU HAVE A FILE WHICH HAS EACH WORD AND A TIME STAMP SO THOSE TWO TIED TOGETHER HAVE EACH WORD AND ITS TIME AND IT'S PROBABILITY YEAH OR OR VALUE YEAH YEAH YEAH BUT WHAT WHAT THE PROBLEM IS I DON'T KNOW EXACTLY I THINK THE INFORMATION GAIN IN RAINBOW IS ORDERED BY THE VALUE OF THE INFORMATION GAIN NOT I AM NOT SURE IF I CAN GET THE RIGHT ORDER AND THE VALUES THAT'S THE PROBLEM BUT I UM IF THE ORDER STAYS THE SAME IT'S NO PROBLEM AT ALL TO I JUST WRITE BACK AGAIN BUT IF UH IT'S ORDERED BY INFORMATION GAIN I DON'T KNOW WHERE THE WORDS COME FROM BECAUSE IT'S IT HAS A BAG OF WORDS REPRESENTATION IT APPEARS TO ME THAT RAINBOW WAS MADE FOR SOMETHING QUITE DIFFERENT IT WAS MADE FOR TEXT CLASSIFICATION SO COULD YOU PUT THE MORE INFORMATION BACK IN THEN YEAH THAT'S THE PROBLEM 'CAUSE IT IT SEEMS TO ME THAT IT'S JUST IT SOUNDS LIKE SOMETHING QUITE DIFFERENT IN IN D MANY ASPECTS MM-HMM UM AND YOU HAVE SEVERAL CATEGORIES AND THEN IT MEASURES UM WHICH WORDS ARE TYPICAL FOR A CERTAIN T CATEGORY AND IF YOU GET A NEW DOCUMENT IT WILL UM COMPARE WHICH WORDS ARE IN THAT NEW DOCUMENT AND IF THERE ARE A LOT OF WORDS THAT UM ARE TYPICAL FOR ONE CATEGORY IT WILL ASSIGN IT TO THAT CATEGORY AND IF IT'S TYPICAL FOR ANOTHER ONE IT WILL ASSIGN IT TO THAT ONE BUT WHERE DO YOU HAVE THE ORIGINAL CATEGORY INFORMATION FROM YEAH IT'S BECAUSE YOU HAVE UM Y UM YOU HAVE UM OTH DIFFERENT FILES IF IF THIS IS YOUR DIRECTORY YOU HAVE UM UM A DIAGRA UM A DIRECTORY ONE TWO AND THREE AND THIS REPRESENTS THE CATEGORY EVERYTHING THAT'S IN THERE IS IN CATEGORY ONE A YEAH BUT THE TOPIC ISN'T IT THAT'S A TOPIC INFORMATION YEAH NO I'VE JUST UM SPLIT THEM UP UH SOMEHOW UM BY UM THERE ARE SEVERAL DOCUMENTS FOR UM EACH MEETING AND I JUST PUT ONE IN EACH CATEGORY SO UH IT'S IT'S NOT VERY SENSIBLE AT THE MOMENT BECAUSE I'M WAITING FOR THE UM TOPIC SEGMENTS OR I'M JUST YEAH 'CAUSE I WAS JUST THINKING THAT DOESN'T MAKE SENSE AT ALL BUT YEAH IF YOU IF THAT'S JUST WHILE YOU'RE WAITING OKAY HAVE YOU EVER LIKE LOOKED INTO DIFFERENT WAYS OF CALCULATING 'CAUSE I WAS JUST THINKING LIKE I MEAN THE FOR EXAMPLE THE THE INFOR UM WHAT'S IT CALLED